Parallel Machine Scheduling with Uncertain Communication Delays
نویسندگان
چکیده
منابع مشابه
Parallel Machine Scheduling with Uncertain Communication Delays
This paper is concerned with scheduling when the data are not fully known before the execution. In that case computing a complete schedule off-line with estimated data may lead to poor performances. Some flexibility must be added to the scheduling process. We propose to start from a partial schedule and to postpone the complete scheduling until execution, thus introducing what we call a stabili...
متن کاملScheduling with Communication Delays
More and more parallel and distributed systems (cluster, grid and global computing) are both becoming available all over the world, and opening new perspectives for developers of a large range of applications including data mining, multimedia, and bio-computing. However, this very large potential of computing power remains largely unexploited this being, mainly due to the lack of adequate and e...
متن کاملScheduling Tasks with Communication Delays on Parallel Processors
Let Jn={v1,...,vn} be a set of n jobs to be executed and E a set of precedence constraints on Jn. Assume that we have available a set Mk={m1,...,mk} of k identical machines that are to execute the jobs in Jn such that the time needed by any machine to execute each job in Jn is one unit. Our main result in this paper is to give an O(n log2(n)) algorithm to find an optimal scheduling with communi...
متن کاملSome Models for Scheduling Parallel Programs with Communication Delays
The aim of this paper is to present and analyze models for designing parallel programs. In the context of some extensions of the most popular execution models (precedence graphs, dataflow, PRAM), we describe scheduling techniques which take into account the communication delays. We illustrate all these models by two families of representative precedence graphs, namely, grids and complete trees.
متن کاملTree Scheduling with Communication Delays
This paper considers the problem of scheduling a tree-structured task system in a distributed environment with the goal of minimizing the makespan. Interprocessor communication delays are taken into account and task duplication is allowed. Furthermore, it is assumed that the number of processors is unlimited. It is shown that there is a polynomial-time algorithm for an outtree and that the intr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2003
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro:2003011